Physics-Informed Neural Networks for Solving Parametric Magnetostatic Problems

نویسندگان

چکیده

The objective of this paper is to investigate the ability physics-informed neural networks learn magnetic field response as a function design parameters in context two-dimensional (2-D) magnetostatic problem. Our approach follows. First, we present functional whose minimization equivalent solving parametric problems. Subsequently, use deep network (DNN) represent space and that describe geometric features operating points. We train DNN by minimizing using stochastic gradient descent. Lastly, demonstrate our on \mbox{ten-dimensional} EI-core electromagnet problem with parameterized geometry. evaluate accuracy comparing its predictions those finite element analysis.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving parametric PDE problems with artificial neural networks

The curse of dimensionality is commonly encountered in numerical partial differential equations (PDE), especially when uncertainties have to be modeled into the equations as random coefficients. However, very often the variability of physical quantities derived from PDE can be captured by a few features on the space of random coefficients. Based on such observation, we propose using neural-netw...

متن کامل

Solving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks

‎Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎In this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎Then‎, ‎we use...

متن کامل

Neural Networks for Solving Quadratic Assignment Problems

Abstract— In this paper the Hopfield neural networks are adopted to solve the quadratic assignment problem, which is a generalization of the traveling salesman’s problem (TSP), the graph-partitioning problem (GPP), and the matching problem. When the Hopfield neural network was applied alone, a sub-optimal solution was obtained. By adding the 2exchange we obtained a solution very close to the op...

متن کامل

solving linear semi-infinite programming problems using recurrent neural networks

‎linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎in this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎by a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎then‎, ‎we use...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Energy Conversion

سال: 2022

ISSN: ['1558-0059', '0885-8969']

DOI: https://doi.org/10.1109/tec.2022.3180295